When Can Predictive Brains be Truly Bayesian?
نویسندگان
چکیده
منابع مشابه
When Can Predictive Brains be Truly Bayesian?
tive coding framework does not yet make stringent commitments as to the nature of the causal models that the brain can represent. Hence, contrary to suggestions by Clark (in press), the framework does not yet have the virtue that it effectively implements tractable Bayesian inference. At this point in time three mutually exclusive options remain open: either predictive coding does not implement...
متن کاملProcedural memory in dissociative identity disorder: when can inter-identity amnesia be truly established?
In a serial reaction time task, procedural memory was examined in Dissociative Identity Disorder (DID). Thirty-one DID patients were tested for inter-identity transfer of procedural learning and their memory performance was compared with 25 normal controls and 25 controls instructed to simulate DID. Results of patients seemed to indicate a pattern of inter-identity amnesia. Simulators, however,...
متن کاملDivisible E-Cash Systems Can Be Truly Anonymous
This paper presents an off-line divisible e-cash scheme where a user can withdraw a divisible coin of monetary value 2 that he can parceled and spend anonymously and unlinkably. We present the construction of a security tag that allows to protect the anonymity of honest users and to revoke anonymity only in case of cheat for protocols based on a binary tree structure without using a trusted thi...
متن کاملCan Machines Truly Think
How do we do that with our computers? We design algorithms, write programs based on our knowledge of the physical phenomena we would like to investigate and predict with better accuracy, run the programs, and interpret the results. The results have a meaning only for the human observer— computers have no knowledge or understanding of the data. This specific limitation has existed from the earli...
متن کاملCan Quantum Computers Be Useful When There
Formulation of the problem. Quantum computers (see, e.g., 5]) have a potential of speeding up computations in many important problems. For example: By using Grover's algorithm 3, 4], for any given error probability e 0 , we can search for an item in an n-item (un-sorted) database in (p n) steps (where checking that a given element is the desired one is counted as a single step). By contrast, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Psychology
سال: 2012
ISSN: 1664-1078
DOI: 10.3389/fpsyg.2012.00406